Some Recursion Formulae for the Number of Derangements and Bell Numbers
نویسندگان
چکیده
In this paper, a further investigation for the number of Derangements and Bell numbers is performed, and some new recursion formulae for the number of Derangements and Bell numbers are established by applying the generating function methods and Padé approximation techniques. Illustrative special cases of the main results are also presented.
منابع مشابه
The q-tangent and q-secant numbers via continued fractions
It is well known that the (−1)-evaluation of the enumerator polynomials of permutations (resp. derangements) by the number of excedances gives rise to tangent numbers (resp. secant numbers). Recently, two distinct q-analogues of the latter result have been discovered by Foata and Han, and Josuat-Vergès, respectively. In this paper, we will prove some general continued fractions expansions formu...
متن کاملInvestigating Fubini and Bell Polynomials with Euler-Seidel Algorithm
This work is based on EulerSeidel matrices ([8]) which is related to algorithms, combinatorics and generating functions. This method is quite useful to investigate properties of some special numbers and polynomials. In this work we use this method to find out some interesting results of Fubini and Bell polynomials and numbers. Although some results are known in this paper, this method provides ...
متن کاملGenerating restricted classes of involutions, Bell and Stirling permutations
We present a recursive generating algorithm for unrestricted permutations which is based on both the decomposition of a permutation as a product of transpositions and that as a union of disjoint cycles. It generates permutations at each recursive step and slight modifications of it produce generating algorithms for Bell permutations and involutions. Further refinements yield algorithms for thes...
متن کاملInvestigating Geometric and Exponential Polynomials with Euler-Seidel Matrices
This work is based on the Euler-Seidel matrix method [11] which is related to algorithms, combinatorics and generating functions. This method is quite useful to investigate properties of some special numbers and polynomials. In this paper we consider the Euler-Seidel matrix method for some combinatorial numbers and polynomials. This method is relatively easier than the most of combinatorial met...
متن کاملA new similarity measure between type-2 fuzzy numbers and fuzzy risk analysis
In this paper, we present a revised similarity measure based onChen-and-Chen's similarity measure for fuzzy risk analysis. The revisedsimilarity measure uses the corrected formulae to calculate the centre ofgravity points, therefore it is more effective than the Chen-and-Chen'smethod. The revised similarity measure can overcome the drawbacks of theexisting methods. We have also proposed a new ...
متن کامل